Mixed-radix discrete cosine transform

This note presents two new fast discrete cosine transform computation algorithms: a radix-3 and a radix-6 algorithm. These two Manuscript received November 21, 1991; revised January 4, 1993. The authors are with the Department of Electronic Engineering, Hong IEEE Log Number 921 1527. Kong Polytechnic, Hung Hom, Kowloon, Hong Kong. new algorithms are superior to the conventional radix-2 algorithm as they i) require less computational complexity in terms of the number of multiplications per point, ii) provide a wider choice of the sequence length for which the DCT can be realized and, iii) support the primefactor-decomposed computation algorithm to realize the 2“3”-point DCT. Furthermore, a mixed-radix algorithm is also proposed such that an optimal performance can be achieved by applying the proposed radix-3 and radix-6 and the well-developed radix-2 decomposition techniques in a proper sequence.